Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
New improved algorithm for superword level parallelism
ZHANG Suping, HAN Lin, DING Lili, WANG Pengxiang
Journal of Computer Applications    2017, 37 (2): 450-456.   DOI: 10.11772/j.issn.1001-9081.2017.02.0450
Abstract558)      PDF (1269KB)(472)       Save
For SLP (Superword Level Parallelism) algorithm cannot effectively process the large-scale applications covered with few parallel codes, and the codes which can be vectorized may be adverse to vectorization. A new improved algorithm for SLP was proposed, namely NSLPO. First of all, the non-isomorphic statements which cannot be vectorized were transformed to isomorphic statements as far as possible, thus locating the opportunities of vectorization which SLP has lost. Secondly, the Max Common Subgraph (MCS) was built by adding redundant nodes, and the supplement diagram of SLP was got by using some optimization such as redundancy deleting, which can greatly increase the parallelism of program. At last, the codes which are harmful to vectorization were exclued out of vectorization by using cutting method and executed in serial, only the valuable codes for vectorization were vectorized to improve the efficiency of programs as far as possible. Experiments were conducted on widely used kernel test sets. The experimental results show that compared with the SLP algorithm, the proposed NSLPO algorithm has better performance and its running time was reduced by 9.1%.
Reference | Related Articles | Metrics
Vector exploring path optimization algorithm of superword level parallelism with subsection constraints
XU Jinlong, ZHAO Rongcai, HAN Lin
Journal of Computer Applications    2015, 35 (4): 950-955.   DOI: 10.11772/j.issn.1001-9081.2015.04.0950
Abstract769)      PDF (877KB)(576)       Save

Superword Level Parallelism (SLP) is a vector parallelism exploration approach for basic block. With loop unrolling, more parallel possibility can be explored. Simultaneously too much exploring paths are brought in. In order to solve the above problem, an optimized SLP method with subsection constraints was proposed. Redundant elimination on segmentation was used to obtain homogeneous segments. Inter-section exploring method based on SLP was used to restrain exploring paths and reduce the complexity of the algorithm. And finally pack adjustment was used to deal with the situation of overlap on memory access. The experimental results show that the vectorization capability of SLP is enhanced; for the test serial program, the average speedup of vectorized version is close to 2.

Reference | Related Articles | Metrics
SIP-based inter-domain network conference system
SHAN Lin-wei,SHAN Xiu-ming,REN Yong
Journal of Computer Applications    2005, 25 (07): 1685-1687.   DOI: 10.3724/SP.J.1087.2005.01685
Abstract901)      PDF (621KB)(723)       Save

Multimedia network conference is an important network application. The management system of network conference is an emphasis of current research activities. Based on the session initiation protocol and the common network conference models, the article designs a two-layer SIP network conference management system for inter-domain conference and presents the implementation of the functions. The paper presents a new SIP extension too.

Reference | Related Articles | Metrics